Permutation group SN and hadron spectroscopy
نویسندگان
چکیده
We discuss the application of the permutation group SN to a few problems in hadron physics. In Ref. [11] a method was proposed for matching a quark model Hamiltonian onto the effective Hamiltonian of the 1/Nc expansion, which makes use of the transformation properties of the states and operators under SN . This method is used in [13] to obtain information about the spinflavor structure of the quark interaction Hamiltonian from the spectrum of the negative parity L = 1 excited baryons. Assuming the most general 2-body quark Hamiltonian, we derive two correlations among the masses and mixing angles of these states which should hold in any quark model. These correlations constrain the mixing angles, and can be used to test for the presence of 3-body quark interactions. We find that the pure gluon-exchange model is disfavored by data, independently of any assumptions about the hadronic wave functions.
منابع مشابه
Permutation codes invariant under isometries
The symmetric group Sn on n letters is a metric space with respect to the Hamming distance. The corresponding isometry group is well known to be isomorphic to the wreath product Sn oS2. A subset of Sn is called a permutation code or a permutation array, and the largest possible size of a permutation code with minimum Hamming distance d is denoted by M(n, d). Using exhaustive search by computer ...
متن کاملPermutation 2-groups I: Structure and Splitness
By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a oneobject 2-group. By a permutation 2-group we mean the 2-group Sym(G) of self-equivalences of a groupoid G and natural isomorphisms between them, with the product given by composition of self-equivalences. These generalize the ...
متن کاملNew Upper Bounds for the Size of Permutation Codes via Linear Programming
An (n, d)-permutation code of size s is a subset C of Sn with s elements such that the Hamming distance dH between any two distinct elements of C is at least equal to d. In this paper, we give new upper bounds for the maximal size μ(n, d) of an (n, d)-permutation code of degree n with 11 6 n 6 14. In order to obtain these bounds, we use the structure of association scheme of the permutation gro...
متن کاملSymmetry groups of boolean functions
We prove that every abelian permutation group, but known exceptions, is the symmetry group of a boolean function. This solves the problem posed in the book by Clote and Kranakis. In fact, our result is proved for a larger class of groups, namely, for all groups contained in direct sums of regular groups. We investigate the problem of representability of permutation groups by the symmetry groups...
متن کاملThe Parameterized Complexity of some Permutation Group Problems
In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. • Given a permutation group G = 〈S〉 ≤ Sn and a parameter k, find a permutation π ∈ G such that |{i ∈ [n] | π(i) 6= i}| ≥ k. This generalizes the NP-complete problem of finding a fixed-point free permutation in G [CW10, Lub81] (this is the case when k = n). We show that this pr...
متن کامل